13 research outputs found
On the stable degree of graphs
We define the stable degree s(G) of a graph G by s(G)∈=∈ min max d (v), where the minimum is taken over all maximal independent sets U of G. For this new parameter we prove the following. Deciding whether a graph has stable degree at most k is NP-complete for every fixed k∈≥∈3; and the stable degree is hard to approximate. For asteroidal triple-free graphs and graphs of bounded asteroidal number the stable degree can be computed in polynomial time. For graphs in these classes the treewidth is bounded from below and above in terms of the stable degree
A Branch and Bound Algorithm for Exact, Upper, and Lower Bounds on Treewidth
In this paper, a branch and bound algorithm for computing the treewidth of a graph is presented. The method incorporates extensions of existing results, and uses new pruning and reduction rules, based upon roperties of the adopted branching strategy. We discuss how the algorithm can not only be used to obtain exact bounds for the treewidth, but also to obtain upper and/or lower bounds. Computational results of the algorithm are presented
Graph Minors and Parameterized Algorithm Design
Abstract. The Graph Minors Theory, developed by Robertson and Sey-mour, has been one of the most influential mathematical theories in pa-rameterized algorithm design. We present some of the basic algorithmic techniques and methods that emerged from this theory. We discuss its direct meta-algorithmic consequences, we present the algorithmic appli-cations of core theorems such as the grid-exclusion theorem, and we give a brief description of the irrelevant vertex technique
Contraction and Treewidth Lower Bounds
Edge contraction is shown to be a useful mechanism to improve lower bound heuristics for treewidth. A successful lower bound for treewidth is the degeneracy: the maximum over all subgraphs of the minimum degree. The degeneracy is polynomial time computable. We introduce the notion of contraction degeneracy: the maximum over all graphs that can be obtained by contracting edges of the minimum degree. We show that the problem to compute the contraction degeneracy is NP-hard, but for fixed k, it is polynomial time decidable if a given graph G has contraction degeneracy at least k. Heuristics for computing the contraction degeneracy are proposed and experimentally evaluated. It is shown that these can lead to considerable improvements to the lower bound for treewidth. A similar study is made for the combination of contraction with Lucena’s lower bound based on Maximum Cardinality Search [12]
On the Maximum Cardinality Search Lower Bound for Treewidth
The Maximum Cardinality Search algorithm visits the vertices of a graph in some order, such that at each step, an unvisited vertex that has the largest number of visited neighbors becomes visited. An MCS-ordering of a graph is an ordering of the vertices that can be generated by the Maximum Cardinality Search algorithm. The visited degree of a vertex v in an MCS-ordering is the number of neighbors of v that are before v in the ordering. The visited degree of an MCS-ordering ψ of G is the maximum visited degree over all vertices v in ψ. The maximum visited degree over all MCS-orderings of graph G is called its maximum visited degree. Lucena [14] showed that the treewidth of a graph G is at least its maximum visited degree. We show that the maximum visited degree is of size O(log n) for planar graphs, and give examples of planar graphs G with maximum visited degree k with O(k!) vertices, for all k ∈ N. Given a graph G, it is NP-complete to determine if its maximum visited degree is at least k, for any fixed k ≥ 7. Also, this problem does not have a polynomial time approximation algorithm with constant ratio, unless P=NP. Variants of the problem are also shown to be NP-complete. We also propose and experimentally analysed some heuristics for the problem. Several tiebreakers for the MCS algorithm are proposed and evaluated. We also give heuristics that give upper bounds on the value of the maximum visited degree of a graph, which appear to give results close to optimal on many graphs from real life applications
Revista brasileira de geografia física : RBGF
Every lower bound for treewidth can be extended by taking the maximum of the lower bound over all subgraphs or minors. This extension is shown to be a very vital idea for improving treewidth lower bounds. In this paper, we investigate a total of nine graph parameters, providing lower bounds for treewidth. The parameters have in common that they all are the vertex-degree of some vertex in a subgraph or minor of the input graph. We show relations between these graph parameters and study their computational complexity. To allow a practical comparison of the bounds, we developed heuristic algorithms for those parameters that are NP-hard to compute. Computational experiments show that combining the treewidth lower bounds with minors can considerably improve the lower bounds
Treewidth lower bounds with brambles
In this paper we present a new technique for computing lower bounds for graph treewidth. Our technique is based on the fact that the treewidth of a graph G is the maximum order of a bramble of G minus one. We give two algorithms: one for general graphs, and one for planar graphs. The algorithm for planar graphs is shown to give a lower bound for both the treewidth and branchwidth that is at most a constant factor away from the optimum. For both algorithms, we report on extensive computational experiments that show that the algorithms give often excellent lower bounds, in particular when applied to (close to) planar graphs
Treewidth: Characterizations, applications, and computations
Abstract. This paper gives a short survey on algorithmic aspects of the treewidth of graphs. Some alternative characterizations and some applications of the notion are given. The paper also discusses algorithms to compute the treewidth of given graphs, and how these are based on the different characterizations, with an emphasis on algorithms that have been experimentally tested.
Fast Fixed-Parameter Tractable Algorithms for Nontrivial Generalizations of Vertex Cover
Our goal in this paper is the development of fast algorithms for recognizing general classes of graphs. We seek algorithms whose complexity can be expressed as a linear function of the graph size plus an exponential function of k, a natural parameter describing the class. In particular, we consider the class W k (G), where for each graph G in W k (G), the removal of a set of at most k vertices from G results in a graph in the base graph class G. (If G is the class of edgeless graphs, W k (G) is the class of graphs with bounded vertex cover.) When G is a minor-closed class such that each graph in G has bounded maximum degree, and all obstructions of G (minor-minimal graphs outside G) are connected, we obtain an O((g + k)jV (G)j + (fk) k ) recognition algorithm for W k (G), where g and f are constants (modest and quantified) depending on the class G. If G is the class of graphs with maximum degree bounded by D (not closed under minors), we can still obtain a running time of O(jV (G)j(D + k) + k(D + k) k+3 ) for recognition of graphs in W k (G). Our results are obtained by considering minor-closed classes for which all obstructions are connected graphs, and showing that the size of any obstruction for W k (G) is O(tk 7 + t 7 k 2 ), where t is a bound on the size of obstructions for G. A trivial corollary of this result is an upper bound of (k + 1)(k + 2) on the number of vertices in any obstruction of the class of graphs with vertex cover of size at most k. These results are of independent graph-theoretic interest